Extension of Preferences to an Ordered Set
نویسنده
چکیده
If a decision maker prefers x to y to z, would he choose orderd set [x, z] or [y, x]? This article studies extension of preferences over individual alternatives to an ordered set which is prevalent in closed ballot elections with proportional representation and other real life problems where the decision maker is to choose from groups with an associated hierarchy inside. I introduce five ordinal decision rules: highest-position, top-q, lexicographic order, max-best, highest-of-best rules and provide axiomatic characterization of them. I also investigate the relationship between ordinal decision rules and the expected utility rule. In particular, whether some ordinal rules induce the same (weak) ranking of ordered sets as the expected utility rule.
منابع مشابه
Convex $L$-lattice subgroups in $L$-ordered groups
In this paper, we have focused to study convex $L$-subgroups of an $L$-ordered group. First, we introduce the concept of a convex $L$-subgroup and a convex $L$-lattice subgroup of an $L$-ordered group and give some examples. Then we find some properties and use them to construct convex $L$-subgroup generated by a subset $S$ of an $L$-ordered group $G$ . Also, we generalize a well known result a...
متن کاملCR-Prolog with Ordered Disjunction
We present CR-Prolog , an extension of CR-Prolog with an improved semantics, and allowing ordered disjunction in the head of both regular rules and consistency-restoring rules. The new semantics yields intuitive conclusions in cases when CR-Prolog would give unintuitive results. The use of ordered disjunction often allows for a more concise, easier to read, representation of knowledge. We also ...
متن کاملTowards Logic Programs with Ordered and Unordered Disjunction
Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunction was developed to express totally ordered preferences for alternatives in rule heads. In this paper we introduce an extension of this approach called Disjunctive Logic Programs with Ordered Disjunction (DLPOD) that combines ...
متن کاملApplications of Preferences using Answer Set Programming
Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case, the goal is to find feasible solutions that most satisfy these additional requirements. In order to represent preferences, in this paper we use an extension of ordered disjunction programs. Ordered disjunction is an...
متن کاملUncertainty analysis of hierarchical granular structures for multi-granulation typical hesitant fuzzy approximation space
Hierarchical structures and uncertainty measures are two main aspects in granular computing, approximate reasoning and cognitive process. Typical hesitant fuzzy sets, as a prime extension of fuzzy sets, are more flexible to reflect the hesitance and ambiguity in knowledge representation and decision making. In this paper, we mainly investigate the hierarchical structures and uncertainty measure...
متن کامل